An Energy Scheduling Algorithm for Ensuring the Pre-determined Lifetime in Sensor Network
نویسندگان
چکیده
Energy limitation of a sensor network is a very important feature which distinguishes it from traditional networks and a number of methods to saving energy consumption have been studied in sensor networks. Most of those works have focused on Network, MAC or PHY layer and the lifetime of a sensor network cannot be pre-determined. But some sensor network might be able to survive for some specified time. In this work, we propose an energy consumption scheduling model, at application level of a node, that ensures predetermined lifetime. To do this, first, we divide applications into six classes and define five operations of an application. Second, an energy consumption model is proposed using those five operations and consumption energies of each operation are calculated by a statistical method. Finally, energy consumption schedules of each application are rebuilt for a node to survive for predetermined lifetime, e.g. varying the period of response and sensing and the number of actuation, etc. Consequently, it is ensured for nodes to survive for the pre-determined lifetime.
منابع مشابه
A JOINT DUTY CYCLE SCHEDULING AND ENERGY AWARE ROUTING APPROACH BASED ON EVOLUTIONARY GAME FOR WIRELESS SENSOR NETWORKS
Network throughput and energy conservation are two conflicting important performance metrics for wireless sensor networks. Since these two objectives are in conflict with each other, it is difficult to achieve them simultaneously. In this paper, a joint duty cycle scheduling and energy aware routing approach is proposed based on evolutionary game theory which is called DREG. Making a trade-off ...
متن کاملImproving Energy-Efficient Target Coverage in Visual Sensor Networks
Target coverage is one of the important problems in visual sensor networks. The coverage should be accompanied with an efficient use of energy in order to increase the network lifetime. In this paper, we address the maximum lifetime for visual sensor networks (MLV) problem by maximizing the network lifetime while covering all the targets. For this purpose, we develop a simulated annealing (SA) ...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Efficient Routing Algorithm to Lifetime Expansion in Wireless Sensor Networks
This paper proposes an efficient network architecture to improve energy consumption in Wireless Sensor Networks (WSN). The proposed architecture uses a mobile data collector to a partitioned network. The mobile data collector moves to center of each logical partition after each decision period. The mobile data collector must declare its new location by packet broadcasting to all sensor node...
متن کاملAn Adaptive LEACH-based Clustering Algorithm for Wireless Sensor Networks
LEACH is the most popular clastering algorithm in Wireless Sensor Networks (WSNs). However, it has two main drawbacks, including random selection of cluster heads, and direct communication of cluster heads with the sink. This paper aims to introduce a new centralized cluster-based routing protocol named LEACH-AEC (LEACH with Adaptive Energy Consumption), which guarantees to generate balanced cl...
متن کامل